A mixed integer quadratic programming formulation for the economic dispatch of generators with prohibited operating zones
نویسندگان
چکیده
منابع مشابه
A mixed integer quadratic programming formulation for the economic dispatch of generators with prohibited operating zones
In this paper, an optimization-based approach is proposed using a mixed integer quadratic programming model for the economic dispatch of electrical power generators with prohibited zones of operation. The main advantage of the proposed approach is its capability to solve case studies from the literature to global optimality quickly and without any targeting of solution procedures.
متن کاملIntelligent Tuned Harmony Search for Solving Economic Dispatch Problem with Valve-point Effects and Prohibited Operating Zones
Economic dispatch with valve point effect and Prohibited Operating Zones (POZs) is a non-convex and discontinuous optimization problem. Harmony Search (HS) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. The performances of these variants are severely affected by selection of different parameters of the algorithm. Intel...
متن کاملAdaptive Differential Evolution Approach for Constrained Economic Power Dispatch with Prohibited Operating Zones
Economic power dispatch (EPD) is one of the main tools for optimal operation and planning of modern power systems. To solve effectively the EPD problem, most of the conventional calculus methods rely on the assumption that the fuel cost characteristic of a generating unit is a continuous and convex function, resulting in inaccurate dispatch. This paper presents the design and application of eff...
متن کاملA Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electric Power Systems Research
سال: 2007
ISSN: 0378-7796
DOI: 10.1016/j.epsr.2006.09.020